Extender based forcings, fresh sets and Aronszajn trees
نویسنده
چکیده
Extender based forcings are studied with respect of adding branches to Aronszajn trees. We construct a model with no Aronszajn tree over אω+2 from the optimal assumptions. This answers a question of Friedman and Halilović [1]. The reader interested only in Friedman and Halilović question may skip the first section and go directly to the second. 1 No branches to κAronszajn trees. We deal here with Extender Based Prikry forcing, Long and short extenders Prikry forcing. Let us refer to [2] for definitions. Theorem 1.1 Extender based Prikry forcing over κ cannot add a cofinal branch to a κAronszajn tree. Proof. Let 〈T,≤T 〉 be a κ-Aronszajn tree. Denote by P the extender based Prikry forcing over κ. Suppose that P adds a cofinal branch through T . Let b ∼ be a name of such branch and 0P b ∼ is a κ -branch through T . Let p, q ∈ P and n < ω. We say that qis an n-extension of p iff q ≥ p and q is obtained from p by taking n-element sequence 〈η1, ..., ηn〉 from the first n-levels of the tree of sets of measures one over the maximal coordinate of p, adding it to p and projecting to all permitted coordinates of p. Denote such q by p〈η1, ..., ηn〉. For each α < κ and p ∈ P there are n < ω and pα ≥∗ p such that any n-extension of pα decides b ∼(α), as was shown in [5]. Note that the branch b ∼ α + 1 is decided as well, since T ∈ V and so the value at the level α determines uniquely the branch to it below. Denote by n(p, α) the least such n.
منابع مشابه
Specializing Aronszajn Trees by Countable Approximations
We show that there are proper forcings based upon countable trees of creatures that specialize a given Aronszajn tree.
متن کاملSpecialising Aronszajn Trees and Preserving Some Weak Diamonds
We show that ♦(R,N ,∈) together with CH and “all Aronszajn trees are special” is consistent relative to ZFC. The weak diamond for the covering relation of Lebesgue null sets was the only weak diamond in the Cichoń diagramme for relations whose consistency together with “all Aronszajn trees are special” was not yet settled. Our forcing proof gives also new proofs to the known consistencies of se...
متن کاملSpecialising Aronszajn trees by countable approximations
We show that there are proper forcings based upon countable trees of creatures that specialise a given Aronszajn tree.
متن کاملSome Applications of Supercompact Extender Based Forcings to Hod
Supercompact extender based forcings are used to construct models with HOD cardinal structure different from those of V . In particular, a model with all regular uncountable cardinals measurable in HOD is constructed.
متن کاملLadder Systems on Trees
We formulate the notion of uniformization of colorings of ladder systems on subsets of trees. We prove that Suslin trees have this property and also Aronszajn trees in the presence of Martin’s Axiom. As an application we show that if a tree has this property, then every countable discrete family of subsets of the tree can be separated by a family of pairwise disjoint open sets. Such trees are t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011